Hybridization Number on Three Rooted Binary Trees is EPT
نویسندگان
چکیده
منابع مشابه
Hybridization Number on Three Rooted Binary Trees is EPT
Phylogenetic networks are leaf-labeled directed acyclic graphs that are used to describe nontreelike evolutionary histories and are thus a generalization of phylogenetic trees. The hybridization number of a phylogenetic network is the sum of all in-degrees minus the number of nodes plus one. The hybridization number problem takes as input a collection of rooted binary phylogenetic trees and ask...
متن کاملHybridization Number on Three Trees
Phylogenetic networks are leaf-labelled directed acyclic graphs that are used to describe nontreelike evolutionary histories and are thus a generalization of phylogenetic trees. The hybridization number of a phylogenetic network is the sum of all indegrees minus the number of nodes plus one. The Hybridization Number problem takes as input a collection of phylogenetic trees and asks to construct...
متن کاملA first step towards computing all hybridization net- works for two rooted binary phylogenetic trees
Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard approach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to ...
متن کاملOn the Combinatorics of Rooted Binary Phylogenetic Trees
We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, also known as rooted binary phylogenetic trees. This study is motivated by the problem of graphically representing evolutionary histories of biological sequences subject to recombination. We investigate some basic properties of the induced SPR-metric on the space r n of leaf-labelled rooted binary trees wi...
متن کاملComputing Hybridization Networks for Multiple Rooted Binary Phylogenetic Trees by Maximum Acyclic Agreement Forests
It is a known fact that given two rooted binary phylogenetic trees the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number. In this work we demonstrate by, first, presenting an algorithm and, second, showing its correctness that this concept is also sufficient in the case of multiple input trees. In detail, we show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2016
ISSN: 0895-4801,1095-7146
DOI: 10.1137/15m1036579